Lecture 2 Introduction to Some Convergence theorems Friday 14 , 2005 Lecturer : Nati Linial

نویسنده

  • Chris Ré
چکیده

r∈Z f̂(r)e In the last lecture, we proved Fejér’s theorem f ∗ kn → f where the ∗ denotes convolution and kn (Fejér kernels) are trignometric polynomials that satisfy 1. kn ≥ 0 2. ∫ T kn = 1 3. kn(s) → 0 uniformly as n→∞ outside [−δ, δ] for any δ > 0. If X is a finite abelian group, then the space of all functions f : X → C forms an algebra with the operations (+, ∗) where + is the usual pointwise sum and ∗ is convolution. If instead of a finite abelian group, we take X to be T then there is no unit in this algebra (i.e., no element h with the property that h ∗ f = f for all f ). However the kn behave as approximate units and play an important role in this theory. If we let Sn(f, t) = n ∑

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture 7 The Brunn - Minkowski Theorem and Influences of Boolean Variables Friday 25 , 2005 Lecturer : Nati Linial

Theorem 7.1 (Brunn-Minkowski). If A, B ⊆ R n satisfy some mild assumptions (in particular, convexity suffices), then [vol (A + B)] 1 n ≥ [vol (A)] 1 n + [vol (B)] 1 n where A + B = { a + b : a ∈ A and b ∈ B}.

متن کامل

Lecture 4 Applications of Harmonic Analysis February 4 , 2005 Lecturer : Nati Linial

Most of our applications of harmonic analysis to computer science will involve only Parseval’s identity. Theorem 4.1 (Parseval’s Identity). ‖f‖2 = ‖f̂‖2 Corollary 4.2. 〈f, g〉 = 〈f̂ , ĝ〉. Proof. Note that 〈f + g, f + g〉 = ‖f + g‖2 = ‖f̂ + g‖2 = ‖f̂ + ĝ‖2. Now as 〈f + g, f + g〉 = ‖f‖2 + ‖g‖2 + 2〈f, g〉, and similarly ‖f̂ + ĝ‖2 = ‖f̂‖2 + ‖ĝ‖2 + 2〈f̂ , ĝ〉, applying Parseval to ‖f‖2 and ‖g‖2 and equating fi...

متن کامل

Lecture 1 Introduction to Fourier Analysis Jan 7 , 2005 Lecturer : Nati Linial

Consider a vector space V (which can be of finite dimension). From linear algebra we know that at least in the finite-dimension case V has a basis. Moreover, there are more than one basis and in general different bases are the same. However, in some cases when the vector space has some additional structure, some basis might be preferable over others. To give a more concrete example consider the...

متن کامل

Lecture 1 Introduction to Fourier Analysis Jan 7 , 2005 Lecturer : Nati Linial Notes : Atri Rudra & Ashish Sabharwal

Consider a vector space V (which can be of finite dimension). From linear algebra we know that at least in the finite-dimension case V has a basis. Moreover, there are more than one basis and in general different bases are the same. However, in some cases when the vector space has some additional structure, some basis might be preferable over others. To give a more concrete example consider the...

متن کامل

An Information - Theoretic Approach to the Supervised Partitioning of the Hierarchical Protein Space

An Information Theoretic Approach to the Supervised Partitioning of the Hierarchical Protein Space Menachem Fromer*, Moriah Friedlich, Noam Kaplan, Nathan Linial and Michal Linial 1 School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel 2 Department of Biological Chemistry, Institute of Life Sciences, The Hebrew University of Jerusalem, Israel [email protected]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005